Post Completeness in Congruential Modal Logics
نویسنده
چکیده
Well-known results due to David Makinson show that there are exactly two Post complete normal modal logics, that in both of them, the modal operator is truthfunctional, and that every consistent normal modal logic can be extended to at least one of them. Lloyd Humberstone has recently shown that a natural analog of this result in congruential modal logics fails, by showing that not every congruential modal logic can be extended to one in which the modal operator is truth-functional. As Humberstone notes, the issue of Post completeness in congruential modal logics is not well understood. The present article shows that in contrast to normal modal logics, the extent of the property of Post completeness among congruential modal logics depends on the background set of logics. Some basic results on the corresponding properties of Post completeness are established, in particular that although a congruential modal logic is Post complete among all modal logics if and only if its modality is truth-functional, there are continuum many modal logics Post complete among congruential modal logics.
منابع مشابه
Strong Completeness of Coalgebraic Modal Logics
Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics often present subtle difficulties – up to the point that canonical models may fail to exist, as is the case e.g. in most probabilistic logics. Here, we present a...
متن کاملFlat modal fixpoint logics with the converse modality
We prove a generic completeness result for a class of modal fixpoint logics corresponding to flat fragments of the two-way mu-calculus, extending earlier work by Santocanale and Venema. We observe that Santocanale and Venema’s proof that least fixpoints in the Lindenbaum-Tarski algebra of certain flat fixpoint logics are constructive, using finitary adjoints, no longer works when the converse m...
متن کاملHow Not to Combine Modal Logics
This paper describes a failed attempt to decompose the fusion of two non-normal modal logics as a composition of iterated nonnormal modalisations. That strategy had already succeeded in the transfer of soundness, completeness and decidability for normal modal logics, but we show here why it fails for the transference of some of these properties in the fusion non-normal modal logics. The possibi...
متن کاملWeak Aggregative Modal Logics with Multi-ary Modal Operators
In this paper we generalize the Apostoli-Brown strategy developed in 1] to show the completeness of a descending chain of weak aggregative modal logics with multi-ary modal operators. The logics presented here are generalization of the weak aggregative unary modal logics developed by Jennings and Schotch in the 80's.
متن کاملFibring Modal First-Order Logics: Completeness Preservation
Fibring is defined as a mechanism for combining logics with a firstorder base, at both the semantic and deductive levels. A completeness theorem is established for a wide class of such logics, using a variation of the Henkin method that takes advantage of the presence of equality and inequality in the logic. As a corollary, completeness is shown to be preserved when fibring logics in that class...
متن کامل